منابع مشابه
Random Graph Generator for Bipartite Networks Modeling
The purpose of this article is to introduce a new iterative algorithm with properties resembling real life bipartite graphs. The algorithm enables us to generate wide range of random bigraphs, which features are determined by a set of parameters. We adapt the advances of last decade in unipartite complex networks modeling to the bigraph setting. This data structure can be observed in several si...
متن کاملAsymptotic Behavior of the Random 3-Regular Bipartite Graph
In 2001, two numerical experiments were performed to observe whether or not the second largest eigenvalue of the adjacency matrix for the random cubic bipartite graph approaches 2 √ 2 as the size of the graph increases. In the first experiment, by Kevin Chang, the graphs were chosen using an algorithm that constructed entirely new graphs at each step using three random permutations, in contrast...
متن کاملReducts of the Random Partial Order
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve this result by showing that there exist exactly five closed permutation groups which contain the automorphism group of the random partial order, and thus expos...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولMinimum-cost matching in a random bipartite graph with random costs
Let G = Gn,n,p be the random bipartite graph on n+n vertices, where each e ∈ [n] appears as an edge independently with probability p. Suppose that each edge e is given an independent uniform exponential rate one cost. Let C(G) denote the expected length of the minimum cost perfect matching. We show that w.h.p. if d = np (log n) then E [C(G)] = (1 + o(1)) 2 6p . This generalises the well-known r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2013
ISSN: 0029-4527
DOI: 10.1215/00294527-1731371